By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 17, Issue 3, pp. 621-942

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On the Minimum Volume Covering Ellipsoid of Ellipsoids

E. Alper Yildirim

pp. 621-641

Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization

Charles Audet and Dominique Orban

pp. 642-664

Bend Minimization in Planar Orthogonal Drawings Using Integer Programming

Petra Mutzel and René Weiskircher

pp. 665-687

A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems

César Gutiérrez, Bienvenido Jiménez, and Vicente Novo

pp. 688-710

Solving Second Order Cone Programming via a Reduced Augmented System Approach

Zhi Cai and Kim-Chuan Toh

pp. 711-737

Modeling Compensation for Optical Fiber Communication Systems

John Zweck and Susan E. Minkoff

pp. 738-775

Sufficient Second-Order Optimality Conditions for an Elliptic Optimal Control Problem with Pointwise Control-State Constraints

A. Rösch and F. Tröltzsch

pp. 776-794

Second-Order Sufficient Conditions for Error Bounds in Banach Spaces

Yiran He and Jie Sun

pp. 795-805

All Linear and Integer Programs Are Slim 3-Way Transportation Programs

Jesús A. De Loera and Shmuel Onn

pp. 806-821

Convergent SDP-Relaxations in Polynomial Optimization with Sparsity

Jean B. Lasserre

pp. 822-843

Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

Amir Beck and Yonina C. Eldar

pp. 844-860

Discontinuous but Well-Posed Optimization Problems

Jacqueline Morgan and Vincenzo Scalzo

pp. 861-870

Corrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path

Xing Liu and Florian A. Potra

pp. 871-890

A Regularized Sample Average Approximation Method for Stochastic Mathematical Programs with Nonsmooth Equality Constraints

Fanwen Meng and Huifu Xu

pp. 891-919

Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares

Markus Schweighofer

pp. 920-942